Aztec Diamonds, Checkerboard Graphs, and Spanning Trees
نویسنده
چکیده
This note derives the characteristic polynomial of a graph that represents nonjump moves in a generalized game of checkers. The number of spanning trees is also determined.
منابع مشابه
Symmetry classes of spanning trees of Aztec diamonds and perfect matchings of odd squares with a unit hole
We say that two graphs are similar if their adjacency matrices are similar matrices. We show that the square grid Gn of order n is similar to the disjoint union of two copies of the quartered Aztec diamond QADn−1 of order n− 1 with the path P (2) n on n vertices having edge weights equal to 2. Our proof is based on an explicit change of basis in the vector space on which the adjacency matrix ac...
متن کاملSpectra and Complexity of Periodic Strips
in its current form and will probably never be published in any form. Nevertheless, it has been cited by other people (R. so I am making it available to those who are interested. Why is the paper unpublishable? After I wrote the paper, it was pointed out to me that an alternating strip and its conjugate are just the two connected components of the tensor product of a path and a bipartite graph....
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملDomino Shuffling on Novak Half-Hexagons and Aztec Half-Diamonds
We explore the connections between the well-studied Aztec Diamond graphs and a new family of graphs called the Half-Hexagons, discovered by Jonathan Novak. In particular, both families of graphs have very simple domino shuffling algorithms, which turn out to be intimately related. This connection allows us to prove an “arctic parabola” theorem for the Half-Hexagons as a corollary of the Arctic ...
متن کامل